Search results for "Design and analysis of algorithms"

showing 2 items of 2 documents

Motif patterns in 2D

2008

AbstractMotif patterns consisting of sequences of intermixed solid and don’t-care characters have been introduced and studied in connection with pattern discovery problems of computational biology and other domains. In order to alleviate the exponential growth of such motifs, notions of maximal saturation and irredundancy have been formulated, whereby more or less compact subsets of the set of all motifs can be extracted, that are capable of expressing all others by suitable combinations. In this paper, we introduce the notion of maximal irredundant motifs in a two-dimensional array and develop initial properties and a combinatorial argument that poses a linear bound on the total number of …

General Computer SciencePattern discoveryTheoretical Computer ScienceCombinatoricsExponential growthMotif extraction Pattern discovery 2D MotifsMotif2D irredundant motifsMotif (music)Pattern matchingRemainderPattern matchingDesign and analysis of algorithmsMathematicsComputer Science(all)Theoretical Computer Science
researchProduct

Algorithmics for the Life Sciences

2013

The life sciences, in particular molecular biology and medicine, have wit- nessed fundamental progress since the discovery of the “the Double Helix”. A rele- vant part of such an incredible advancement in knowledge has been possible thanks to synergies with the mathematical sciences, on the one hand, and computer science, on the other. Here we review some of the most relevant aspects of this cooperation focusing on contributions given by the design, analysis and engineering of fast al- gorithms for the life sciences.

Theoretical computer scienceSettore INF/01 - InformaticaKolmogorov complexityMathematical scienceslawComputer scienceSuffix treeAlgorithmicsDesign and Analysis of Algorithms Bioinformaticslaw.invention
researchProduct